Improved Approximation for Min-Sum Vertex Cover
نویسندگان
چکیده
The paper describes an approximation algorithm for the Min Sum Vertex Cover (MSVC) problem, achieving a constant approximation factor strictly smaller than 2, thus improving on the best currently known approximation algorithm for the problem. ∗Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel. E-mail: [email protected]. †Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel, and Microsoft Research, Redmond, Washington. E-mail: [email protected]. ‡Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel. E-mail: [email protected]. Supported in part by a grant from the Israel Science Foundation.
منابع مشابه
Approximating Minimum Linear Ordering Problems
This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...
متن کاملResults on the min-sum vertex cover problem
Let G be a graph with the vertex set V (G), edge set E(G). A vertex labeling is a bijection f : V (G)→ {1, 2, . . . , |V (G)|}. The weight of e = uv ∈ E(G) is given by g(e) = min{f(u), f(v)}. The min-sum vertex cover (msvc) is a vertex labeling that minimizes the vertex cover number μs(G) = ∑ e∈E(G) g(e). The minimum such sum is called the msvc cost. In this paper, we give both general bounds a...
متن کاملThe Limits of Tractability: MIN-VERTEX-COVER
Today, we are talking about the MIN-VERTEX-COVER problem. MIN-VERTEX-COVER is a classic NP-hard optimization problem, and to solve it, we need to compromise. We look at three approaches. First, we consider restricting our attention to a special case: a (binary) tree. Then, we look at an exponential algorithm parameterized by the size of the vertex cover. Finally, we look at approximation algori...
متن کاملThe Generalized Subgraph Problem: Complexity, Approximability and Polyhedra
This paper is concerned with a problem on networks which we call the Generalized Subgraph Problem (GSP). The GSP is defined on an undirected graph where the vertex set is partitioned into clusters. The task is to find a subgraph which touches at most one vertex in each cluster so as to maximize the sum of vertex and edge weights. The GSP is a relaxation of several important problems of a ‘gener...
متن کاملImproved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
Given an undirected weighted graph G = (V,E), a set C1, C2, . . . , Ck of cycles is called a cycle cover of V ′ if V ′ ⊂ ∪i=1V (Ci) and its cost is the maximum weight of the cycles. The Min-Max Cycle Cover Problem(MMCCP) is to find a minimum cost cycle cover of V with at most k cycles. The Rooted Min-Max Cycle Cover Problem(RMMCCP) is to find a minimum cost cycle cover of V \D with at most k cy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006